package leetcode.greedy;

import leetcode.twopoint.common.TwoPointUtils;

class Solution11 {
    public int maxArea(int[] height) {
//        return GreedyUtils.maxArea(height);
        return TwoPointUtils.maxArea(height);

    }
}

public class leetcode11 {
    public static void main(String[] args) {
        Solution11 solution11 = new Solution11();
        int[] nums = {1,8,6,2,5,4,8,3,7};
        int[] nums1 = {1,1};
        System.out.println(solution11.maxArea(nums));
        System.out.println(solution11.maxArea(nums1));
    }
}
